THE EDGE VERSION OF RANDIC, ZAGREB, ATOM BOND CONNECTIVITY AND GEOMETRIC-ARITHMETIC INDICES OF HAC_5C_6C_7[P,Q] NANOTUBE
نویسندگان
چکیده
منابع مشابه
Comparing the excepted values of atom-bond connectivity and geometric–arithmetic indices in random spiro chains
The atom-bond connectivity (ABC) index and geometric-arithmetic (GA) index are two well-studied topological indices, which are useful tools in QSPR and QSAR investigations. In this paper, we first obtain explicit formulae for the expected values of ABC and GA indices in random spiro chains, which are graphs of a class of unbranched polycyclic aromatic hydrocarbons. Based on these formulae, we t...
متن کاملOn Second Atom-Bond Connectivity Index
The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G) uvE (G ) (du dv 2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.
متن کاملOn the total version of geometric-arithmetic index
The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.
متن کاملTwo Types of Geometric–Arithmetic Index of V–phenylenic Nanotube
The concept of geometric-arithmetic indices was introduced in the chemical graph theory. These indices are defined by the following general formula: ( ) 2 ( ) uv E G u v u v Q Q Q Q GA G , where Qu is some quantity that in a unique manner can be associated with the vertex u of graph G. In this paper the exact formula for two types of geometric-arithmetic index of Vphenylenic nanotube ar...
متن کاملOn generalized atom-bond connectivity index of cacti
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2017
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v115i2.17